#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n,k,m;cin>>n>>k>>m;
  double sum=0;
  for(LL i=1;i<=n;i++) cin>>a[i],sum+=1.0*a[i];
  sort(a+1,a+1+n);
  LL cnt=n;
  double ave=(1.0*sum+1.0*min(1.0*n*k,1.0*m))/(1.0*n);
  for(LL i=1;i<=n;i++){
      if(m>0&&cnt>=2){
            m--;
            sum-=1.0*a[i];
            cnt--;
            if(m>0&&m>=k*cnt) ave=max(ave,1.0*(1.0*sum+1.0*k*cnt)/(1.0*cnt));
            else if(m>0&&m<k*cnt) ave=max(ave,1.0*(1.0*sum+1.0*m)/(1.0*cnt));
      }
      else if(cnt==1){
           ave=max(ave,1.0*(1.0*sum+1.0*min(k,m))/1.0);
      }
  }
  printf("%lf\n",ave);
return 0;
}
